Consistent Partial Model Checking

Consistent Partial Model Checking

We propose assertion-consistency (AC) semi-lattices as suitable orders for the analysis of partial models. Such orders express semantic entailment, multiple-viewpoint and multiple-valued analysis, maintain internal consistency of reasoning, and subsume finite De Morgan lattices. We classify those orders that are finite and distributive and apply them to design an efficient algorithm for multipl...

Partial Model Checking

A major obstacle in applying nite-state model checking to the veriication of large systems is the com-binatorial explosion of the state space arising when many loosely coupled parallel processes are considered. The problem also known as the state-explosion problem has been attacked from various sides. This paper presents a new approach based on partial model checking: Parts of the concurrent sy...

Partial Model Checking ( Extended

A major obstacle in applying finite-state model checking t o the verification of large systems is the combinatorial explosion of the state space arising when m a n y loosely coupled parallel processes are considered. T h e problem also known as the state-explosion problem has been attacked from various sides. This paper presents a new approach based o n partial model checking: Parts of the conc...

Publications: Partial Order Model Checking

Partial Model Checking with ROBDDs

This paper introduces a technique for localizing model checking of concurrent state-based systems. The technique, called partial model checking, is fully automatic and performs model checking by gradually specializing the speciication with respect to the concurrent components one by one, computing a \concurrent weakest precondition." Speciications are invariance properties and the concurrent co...